Enhancing synchronizability of weighted dynamical networks using betweenness centrality
نویسندگان
چکیده
منابع مشابه
Enhancing synchronizability of weighted dynamical networks using betweenness centrality.
By considering the eigenratio of the Laplacian of the connection graph as a synchronizability measure, we propose a procedure for weighting dynamical networks to enhance their synchronizability. The method is based on node and edge betweenness centrality measures and is tested on artificially constructed scale-free, Watts-Strogatz, and random networks as well as on some real-world graphs. It is...
متن کاملEfficient rewirings for enhancing synchronizability of dynamical networks.
In this paper, we present an algorithm for optimizing synchronizability of complex dynamical networks. Starting with an undirected and unweighted network, we end up with an undirected and unweighted network with the same number of nodes and edges having enhanced synchronizability. To this end, based on some network properties, rewirings, i.e., eliminating an edge and creating a new edge elsewhe...
متن کاملBetweenness centrality in a weighted network.
When transport in networks follows the shortest paths, the union of all shortest path trees G union or logical sum SPT can be regarded as the "transport overlay network." Overlay networks such as peer-to-peer networks or virtual private networks can be considered as a subgraph of G union or logical sum SPT. The traffic through the network is examined by the betweenness Bl of links in the overla...
متن کاملReconstruction of Networks from Their Betweenness Centrality
In this paper we study the reconstruction of a network topology from the values of its betweenness centrality, a measure of the influence of each of its nodes in the dissemination of information over the network. We consider a simple metaheuristic, simulated annealing, as the combinatorial optimization method to generate the network from the values of the betweenness centrality. We compare the ...
متن کاملApproximating Betweenness Centrality in Large Evolving Networks
Betweenness centrality ranks the importance of nodes by their participation in all shortest paths of the network. Therefore computing exact betweenness values is impractical in large networks. For static networks, approximation based on randomly sampled paths has been shown to be significantly faster in practice. However, for dynamic networks, no approximation algorithm for betweenness centrali...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2008
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.78.016105